An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries

نویسندگان

Pankaj K. Agarwal

Lars Arge

Haim Kaplan

Eyal Molad

Robert E. Tarjan

Ke Yi

چکیده

Let S be a set of n intervals in R, and let (S,+) be any commutative semigroup. We assign a weight ω(s) ∈ S to each interval in S. For a point x ∈ R, let S(x) ⊆ S be the set of intervals that contain x. Given a point q ∈ R, the stabbing-semigroup query asks for computing

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time

In this paper we describe a dynamic data structure that answers one-dimensional stabbingmax queries in optimal O(log n/ log log n) time. Our data structure uses linear space and supports insertions and deletions in O(log n) and O(log n/ log log n) amortized time respectively. We also describe a O(n(log n/ log log n)d−1) space data structure that answers d-dimensional stabbing-max queries in O((...

متن کامل

I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries

We develop several linear or near-linear space and I/Oefficient dynamic data structures for orthogonal range-max queries and stabbing-max queries. Given a set of N weighted points in R, the rangemax problem asks for the maximum-weight point in a query hyperrectangle. In the dual stabbing-max problem, we are given N weighted hyper-rectangles, and we wish to find the maximum-weight rectangle cont...

متن کامل

ارائه روشی پویا جهت پاسخ به پرس‌وجوهای پیوسته تجمّعی اقتضایی

Data Streams are infinite, fast, time-stamp data elements which are received explosively. Generally, these elements need to be processed in an online, real-time way. So, algorithms to process data streams and answer queries on these streams are mostly one-pass. The execution of such algorithms has some challenges such as memory limitation, scheduling, and accuracy of answers. They will be more ...

متن کامل

Optimal External Memory Interval

In this paper we present the external interval tree, an optimal external memory data structure for answering stabbing queries on a set of dynamically maintained intervals. The external interval tree can be used in an optimal solution to the dynamic interval management problem, which is a central problem for object-oriented and temporal databases and for constraint logic programming. Part of the...

متن کامل